Improved complexity bounds for real root isolation using Continued Fractions

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of ÕB(d + dτ + dτ) for isolating the real roots of a polynomial with integer coefficients using the classic variant of CF, where d is the degree of the polynomial and τ the maximum bitsize of its coefficients. This improves the previous bound by Sharma [30] by a factor of d and matches the bound derived by Mehlhorn and Ray [21] for another variant of CF; it also matches the worst case bound of the subdivisionbased solvers. We present a new variant of CF, we call it iCF, that isolates the real roots of a polynomial with integer coefficients in ÕB(d + dτ), thus improving the current known bound for the problem by a factor of d. If the polynomial has only real roots, then our bound becomes ÕB(d + dτ + dτ), thus matching the bound of the numerical algorithms by Reif [27] and by Ben-Or and Tiwari [7]. Actually the latter bound holds in a more general setting, that is under the rather mild assumption that Ω(d/ lg d), where c ≥ 0 is a constant, roots contribute to the sign variations of the coefficient list of the polynomial. This is the only bound on exact algorithms that matches the one of the numerical algorithms by Pan [25] and Schönhage [29]. To our knowledge the presented bounds are the best known for the problem of real root isolation for algorithms based on exact computations.